Resultaten visas 1 - 10 / 605
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

Constructing Combinatorial Designs by Local Search

Nurmela, K.
-1993

Mosaics of combinatorial designs

Referentgranskad
DOI
10.1007/s10623-017-0328-6
Gnilke, Oliver Wilhelm; Greferath, Marcus; Pavčević, Mario Osvin
Designs, Codes and Cryptography2018

Computational methods in design theory

Referentgranskad
Gibbons, P.B.; Östergård, Patric Ralf Johan
Chapman and Hall2007

Combinatorial Optimization of Graphical User Interface Designs

Referentgranskad
Öppen tillgång
DOI
10.1109/JPROC.2020.2969687
Oulasvirta, Antti; Dayama, N. R.; Shiripour, M.; John, M.; Karrenbauer, A.
Proceedings of the IEEE2020

Constructing Covering Designs by Simulated Annealing

Nurmela, K.; Östergård, P.
-1993

Isomorph-Free Exhaustive Generation of Combinatorial Designs

Kaski, Petteri
-2001

Upper Bounds for Covering Designs by Simulated Annealing

Referentgranskad
Nurmela, K.; Östergård, P.
Proceedings of the Manitoba Conference on Numerical Mathematics1993

Optimization, block designs and No Free Lunch theorems

Referentgranskad
Öppen tillgång
DOI
10.1016/j.ipl.2004.12.015
Griffiths, Evan; Orponen, Pekka
Information Processing Letters2005

Combinatorial code designs for ultra-reliable IoT Random access

Referentgranskad
Öppen tillgång
DOI
10.1109/PIMRC.2017.8292784
Boyd, Christopher; Vehkalahti, Roope; Tirkkonen, Olav
IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications workshops2018

Combinatorial optimization for user interface design

Referentgranskad
DOI
10.1093/oso/9780198799603.003.0005
Oulasvirta, Antti; Karrenbauer, Andreas
Oxford University Press2018

Constructing Combinatorial Designs by Local Search

1993

Mosaics of combinatorial designs

Referentgranskad
DOI
10.1007/s10623-017-0328-6
2018

Computational methods in design theory

Referentgranskad
2007

Combinatorial Optimization of Graphical User Interface Designs

Referentgranskad
Öppen tillgång
DOI
10.1109/JPROC.2020.2969687
2020

Constructing Covering Designs by Simulated Annealing

1993

Isomorph-Free Exhaustive Generation of Combinatorial Designs

2001

Upper Bounds for Covering Designs by Simulated Annealing

Referentgranskad
1993

Optimization, block designs and No Free Lunch theorems

Referentgranskad
Öppen tillgång
DOI
10.1016/j.ipl.2004.12.015
2005

Combinatorial code designs for ultra-reliable IoT Random access

Referentgranskad
Öppen tillgång
DOI
10.1109/PIMRC.2017.8292784
2018

Combinatorial optimization for user interface design

Referentgranskad
DOI
10.1093/oso/9780198799603.003.0005
2018